# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def thirdMax(self, nums: List[int]) -> int:
        min_value = - (2 ** 32)
        max_1 = max_2 = max_3 = min_value
        
        for number in nums:
            if number == max_1 or number == max_2 or number == max_3:
                continue
            
            if number > max_1:
                if max_2 != min_value:
                    max_3 = max_2
                if max_1 != min_value:
                    max_2 = max_1
                max_1 = number
            elif number > max_2:
                if max_2 != min_value:
                    max_3 = max_2
                max_2 = number
            elif number > max_3:
                max_3 = number
        
        if max_3 == min_value or max_3 == max_2:
            return max_1
        else:
            return max_3


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 2, 3, 1], 1),
        ([3,2,1], 1),
        ([1, 2], 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.thirdMax(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

